Uncheatable Reputation for Distributed Computation Markets
نویسندگان
چکیده
Reputation systems aggregate mutual feedback of interacting peers into a “reputation” metric for each participant. This is then available to prospective service “requesters” (clients) for the purpose of evaluation and subsequent selection of potential service “providers” (servers). For a reputation framework to be effective, it is paramount for both the individual feedback and the reputation storage mechanisms to be trusted and able to deal with faulty behavior of participants such as “ballot stuffing” (un-earned positive feedback) and “bad-mouthing” (incorrect negative feedback). While, in human-driven (e.g. Ebay) environments, these issues are dealt with by hired personnel, on a case by case basis, in automated environments, this ad-hoc manner of handling is likely not acceptable. Stronger, secure mechanisms of trust are required. In this paper we propose a solution for securing reputation mechanisms in computing markets and grids where servers offer and clients demand compute services. We introduce threshold witnessing, a mechanism in which a minimal set of “witnesses” provide service interaction feedback and sign associated ratings for the interacting parties. This endows traditional feedback rating with trust while handling both “ballot-stuffing” and “badmouthing” attacks. Witnessing relies on a challenge-response protocol in which servers provide verifiable computation execution proofs. An added benefit is an assurance of computation result correctness.
منابع مشابه
Searching for High-Value Rare Events with Uncheatable Grid Computing
High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitio...
متن کاملUncheatable Distributed Computations
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Internet has made it possible to invite the participation of just about any computer in such distributed computations. This introduces the potential for cheating by untrusted participants. In a commercial setting where part...
متن کاملPersonalized Reputation Management in P2P Networks
P2P networks have become increasingly popular in the recent years. However, their open, distributed and anonymous nature makes them very vulnerable against malicious users who provide bad responses to requests from other peers. Motivated by this observation, various solutions for distributed reputation systems have been presented recently. In this paper, we describe the first reputation system ...
متن کاملRisky Business: Motivations for Markets in Programmable Networks
We believe that the problems of safety, security and resource usage combine to make it unlikely that programmable networks will ever be viable without mechanisms to transfer risk from the platform provider to the user and the programmer. However, we have well established mechanisms for managing risk markets. In this paper we argue for the establishment of markets to manage the risk in running a...
متن کاملChapter 15 Reputation
Why Read This Chapter? To understand the different conceptions underlying reputation in simulations up to the current time and to get to know some of the approaches to implementing reputation mechanisms, which are more cognitively sophisticated. Abstract In this chapter, the role of reputation as a distributed instrument for social order is addressed. A short review of the state of the art will...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006